Security of Blind Digital Signatures
نویسندگان
چکیده
Blind digital signatures were introduced by Chaum. In this paper, we show how security and blindness properties for blind digital signatures, can be simultaneously defined and satisfied in the common reference string model, assuming an arbitrary one-way trapdoor permutation family. Thus, this paper presents the first complexity-based proof of security for blind signatures.
منابع مشابه
Security of Blind Digital
Blind digital signatures were introduced by Chaum. In this paper, we show how security and blindness properties for blind digital signatures, can be simultaneously deened and satissed, assuming an arbitrary one-way trapdoor permutation family. Thus, this paper presents the rst complexity-based proof of security for blind signatures.
متن کاملSecurity of Blind Digital Signatures (Extended Abstract)
Blind digital signatures were introduced by Chaum. In this paper, we show how security and blindness properties for blind digital signatures, can be simultaneously de ned and satis ed, assuming an arbitrary one-way trapdoor permutation family. Thus, this paper presents the rst complexity-based proof of security for blind signatures.
متن کاملEfficient Blind and Partially Blind Signatures Without Random Oracles
This paper proposes a new ecient signature scheme from bilinear maps that is secure in the standard model (i.e., without the random oracle model). Our signature scheme is more eective in many applications (e.g., blind signatures, group signatures, anonymous credentials etc.) than the existing secure signature schemes in the standard model such as the Boneh-Boyen [6], Camenisch-Lysyanskaya [10],...
متن کاملEcient Blind and Partially Blind Signatures without Random Oracles
This paper proposes a new ecient signature scheme from bilinear maps that is secure in the standard model (i.e., without the random oracle model). Our signature scheme is more eective in many applications (e.g., blind signatures, group signatures, anonymous credentials etc.) than the existing secure signature schemes in the standard model. As typical applications of our signature scheme, this p...
متن کاملA Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges between the signer and the user or are limited to issue only logarithmically many signatures in terms of a security parameter. This paper presents an efficient blind signature scheme that allows a polynomial number of signatures to...
متن کامل